Counterfactual universal quantum computation
نویسندگان
چکیده
منابع مشابه
Quantum cellular automaton for universal quantum computation
A number of physical systems that are considered for the realization of a universal quantum computer, such as optical lattices 1 or arrays of microlenses 2 , possess a translation symmetry in the arrangement of qubits and their mutual interaction. Quantum cellular automata QCA represent a suitable framework to explore the computational power of such physical systems, because they respect this s...
متن کاملUniversal computation by quantum walk.
In some of the earliest work on quantum computing, Feynman showed how to implement universal quantum computation with a time-independent Hamiltonian. I show that this remains possible even if the Hamiltonian is restricted to be the adjacency matrix of a low-degree graph. Thus quantum walk can be regarded as a universal computational primitive, with any quantum computation encoded in some graph....
متن کاملCounterfactual computation
Suppose that we are given a quantum computer programmed ready to perform a computation if it is switched on. Counterfactual computation is a process by which the result of the computation may be learnt without actually running the computer. Such processes are possible within quantum physics and to achieve this e¬ect a computer embodying the possibility of running the computation must be availab...
متن کاملSuperadiabatic Controlled Evolutions and Universal Quantum Computation
Adiabatic state engineering is a powerful technique in quantum information and quantum control. However, its performance is limited by the adiabatic theorem of quantum mechanics. In this scenario, shortcuts to adiabaticity, such as provided by the superadiabatic theory, constitute a valuable tool to speed up the adiabatic quantum behavior. Here, we propose a superadiabatic route to implement un...
متن کاملUniversal quantum computation in a hidden basis
Let |0 and |1 be two states that are promised to come from known subsets of orthogonal subspaces, but are otherwise unknown. We consider computing with respect to the hidden computational basis {|0 , e iθ |1} ⊗n of n logical qubits, for some phase angle θ. We investigate the number of physical copies of |0 and |1 that are required to perform unitary operations and to prepare quantum states defi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review A
سال: 2020
ISSN: 2469-9926,2469-9934
DOI: 10.1103/physreva.102.052413